The Switched Local Area Networks’ Delay Problem: Issues and a Deterministic Solution Approach

A large number of installed local area networks are sluggish in terms of speed of uploading and down- loading of information. Researchers have, therefore, proposed the need for such networks to be designed with specified maximum end-to-end delay. This is because, if the maximum packet delay between any two nodes of a network is not known, it is impossible to provide a deterministic guarantee of worst case response times of packets’ flows. Therefore, the need for analytic and formal basis for designing such networks becomes very imperative. In this regard, this chapter has discussed the switched local area networks’ delay problem and related issues. It compared the two principal approaches for determining the end-to-end response times of flows in communication networks – stochastic approach and determin- istic approach. The chapter goes on to demonstrate the superiority of the latter approach by using it to develop and validate the goodness of a general maximum delay packet switch model

Markov Models of Telephone Speech Dialogues

Analogue speech signals are the most natural form of communication among humans. The contemporary methods adopted for the analysis of voice transmission by packet switching were designed mainly with respect to a Poisson stream of input packets, for which the probability of an active packet on each input port of the router is a constant value in time. An assumption that is not always valid, since the formation of speech packets during a dialogue is a non-stationary process, in which case mathematical modeling becomes an effective method of analysis, through which necessary estimates of a network node being designed for packet transmission of speech may be obtained. This paper presents the result of analysis of mathematical models of Markov chain based speech packet sources vis-à-vis the peculiarities of telephone dialogue models. The derived models can be employed in the design and development of methods of statistical multiplexing of packet switching network nodes

Markov Models of Statistical Multiplexing of Telephone Dialogue with Packet Switching

Existing methods of analysis of voice transmission by packet switching were designed mainly with respect to a Poisson stream of input packets, for which the probability of an active packet on each input port of the router is a constant value in time. This assumption is not always valid, since the formation of speech packets during a dialogue is a nonstationary process, in which case mathematical modeling becomes an effective method of analysis, through which necessary estimates of a network node being designed for packet transmission of speech may be obtained. This paper presents the result of analysis of mathematical models of Markov chain based speech packet sources vis-à-vis the peculiarities of telephone dialogue models. The derived models can be employed in the design and development of methods of statistical multiplexing of packet switching network nodes